Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines*1
نویسندگان
چکیده
منابع مشابه
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
The -rst attempts concerning formalization of the notion of fuzzy algorithms in terms of Turing machines are dated in late 1960s when this notion was introduced by Zadeh. Recently, it has been observed that corresponding so-called classical fuzzy Turing machines can solve undecidable problems. In this paper we will give exact recursion-theoretical characterization of the computational power of ...
متن کاملThe difference between Clocks and Turing Machines1
Content: 1. Clocks and Logic. 2. Turing Machines and the distinction between Hardware and Software 3. Simulating Turing Machines by Clocks. 4. Finite representations in Physics and in Metamathematics. 5. Mathematics as an open system. 6. Interactive, asynchronous and distributed computing. 7. Plasticity and the wet brain. 8. Implicit Mathematics APPENDIX: More on the proofs of unprovable propos...
متن کاملOn the computing power of fuzzy Turing machines
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively enumerable (r.e.) sets and universality. FTMs are first regarded as acceptors. It has recently been shown by J. Wiedermann that these machines have more computational power than classical Turing machines. Still, the c...
متن کاملClassical Computability and Fuzzy Turing Machines
We work with fuzzy Turing machines (ftms) and we study the relationship between this computational model and classical recursion concepts such as computable functions, r.e. sets and universality. ftms are first regarded as acceptors. It has recently been shown in [23] that these machines have more computational power than classical Turing machines. Still, the context in which this formulation i...
متن کاملSuper-Turing or Non-Turing? Extending the Concept of Computation
“Hypercomputation” is often defined as transcending Turing computation in the sense of computing a larger class of functions than can Turing machines. While this possibility is important and interesting, this paper argues that there are many other important senses in which we may “transcend Turing computation.” Turing computation, like all models, exists in a frame of relevance, which underlies...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00631-5